Convex Relaxations and Approximations of Chance-Constrained AC-OPF Problems
نویسندگان
چکیده
منابع مشابه
Convex relaxations of chance constrained optimization problems
In this paper we develop convex relaxations of chance constrained optimization problems in order to obtain lower bounds on the optimal value. Unlike existing statistical lower bounding techniques, our approach is designed to provide deterministic lower bounds. We show that a version of the proposed scheme leads to a tractable convex relaxation when the chance constraint function is affine with ...
متن کاملConvex Relaxations of Chance Constrained AC Optimal Power Flow
High penetration of renewable energy sources and the increasing share of stochastic loads require the explicit representation of uncertainty in tools such as the optimal power flow (OPF). Current approaches follow either a linearized approach or an iterative approximation of non-linearities. This paper proposes a semidefinite relaxation of a chance constrained AC-OPF which is able to provide gu...
متن کاملConvex Approximations of Chance Constrained Programs
We consider a chance constrained problem, where one seeks to minimize a convex objective over solutions satisfying, with a given close to one probability, a system of randomly perturbed convex constraints. Our goal is to build a computationally tractable approximation of this (typically intractable) problem, i.e., an explicitly given deterministic optimization program with the feasible set cont...
متن کاملThe Price of Uncertainty: Chance-constrained OPF vs. In-hindsight OPF
The operation of power systems has become more challenging due to feed-in of volatile renewable energy sources. Chance-constrained optimal power flow (ccOPF) is one possibility to explicitly consider volatility via probabilistic uncertainties resulting in mean-optimal feedback policies. These policies are computed before knowledge of the realization of the uncertainty is available. On the other...
متن کاملConvex Relaxations for Permutation Problems
Seriation seeks to reconstruct a linear order between variables using unsorted, pairwise similarity information. It has direct applications in archeology and shotgun gene sequencing, for example. We write seriation as an optimization problem by proving the equivalence between the seriation and combinatorial 2-SUM problems on similarity matrices (2-SUM is a quadratic minimization problem over pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2019
ISSN: 0885-8950,1558-0679
DOI: 10.1109/tpwrs.2018.2874072